Lecture 14 : The Lovász Local Lemma and the Independence Polynomial

نویسنده

  • S. S. Mukherjee
چکیده

iff px ∈ [0, 1) for all x. When the events are not independent, an answer is given by the Lovász local lemma (and its variations). Definition 14.1. We say that G is the dependency graph of (Ax)x∈X if for all x ∈ X, Ax is independent of the σ-algebra generated by the collection {Ay | y / ∈ Γ∗(x)} (where Γ(x) is the set of neighbours of x in G and Γ∗(x) := Γ(x) ∪ {x}). Theorem 14.2 (Lovász local lemma). Let G be the dependency graph for the of events (Ax)x∈X , and suppose that (rx)x∈X ∈ [0, 1)X such that, for each x, P(Ax) ≤ rx ∏

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lovász Local Lemma

We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lovász local lemma in probabilistic combinatorics. We show that the conclusion of the Lovász local lemma holds for dependency graph G and probabilities {px} if and only if the independent-set polynomial for G is nonvanishing in the polydisc of radii {px}. Furthermore, we show that th...

متن کامل

CS 7880 : Algorithmic Power Tools Scribe

• Two Simple Applications of the LLL • Packet Routing In this lecture, we prove the general form of the Lovász Local Lemma, and see two applications of the lemma: hypergraph coloring and finding satisfying assignments for Boolean CNF formulas. We then begin studying packet routing, another area in which we will apply the lemma. In the last lecture, we proved the symmetric form of the Lovász Loc...

متن کامل

On Dependency Graphs and the Lattice Gas

We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lovász local lemma in probabilistic combinatorics. We show that the conclusion of the Lovász local lemma holds for dependency graph G and probabilities {px} if and only if the independent-set polynomial for G is nonvanishing in the polydisc of radii {px}. Furthermore, we show that th...

متن کامل

An Improvement of the Lovász Local Lemma via Cluster Expansion

An old result by Shearer relates the Lovász Local Lemma with the independent set polynomial on graphs, and consequently, as observed by Scott and Sokal, with the partition function of the hard core lattice gas on graphs. We use this connection and a recent result on the analyticity of the logarithm of the partition function of the abstract polymer gas to get an improved version of the Lovász Lo...

متن کامل

Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma

The Lovász Local Lemma is a sieve method to prove the existence of certain structures with certain prescribed properties. In most of its applications the Lovász Local Lemma does not supply a polynomial-time algorithm for finding these structures. Beck was the first who gave a method of converting some of these existence proofs into efficient algorithmic procedures, at the cost of loosing a litt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015